Lower Bounds for Quantum Communication Complexity
نویسندگان
چکیده
منابع مشابه
Lower Bounds for Quantum Communication Complexity
We prove new lower bounds for bounded error quantum communication complexity. Our methods are based on the Fourier transform of the considered functions. First we generalize a method for proving classical communication complexity lower bounds developed by Raz [30] to the quantum case. Applying this method we give an exponential separation between bounded error quantum communication complexity a...
متن کاملLower Bounds on Communication Complexity ∗
A notion of ”communication complexity” is used to formally measure the degree to which a Boolean function is ”global”. An explicit combinatorial lower bound for this complexity measure is presented. In particular, this leads to an exp(Ω( √ n)) lower bound on the complexity of depth-restricted contact schemes computing some natural Boolean functions in NP.
متن کاملLower Bounds in Communication Complexity
The communication complexity of a function f(x, y) measures the number of bits that two players, one who knows x and the other who knows y, must exchange to determine the value f(x, y). Communication complexity is a fundamental measure of complexity of functions. Lower bounds on this measure lead to lower bounds on many other measures of computational complexity. This monograph survey lower bou...
متن کاملQuantum Multiparty Communication Complexity and Circuit Lower Bounds
We define a quantum model for multiparty communication complexity and prove a simulation theorem between the classical and quantum models. As a result, we show that if the quantum k-party communication complexity of a function f is Ω( n 2k ), then its classical k-party communication is Ω( n 2k/2 ). Finding such an f would allow us to prove strong classical lower bounds for k ≥ log n players and...
متن کاملCommunication Complexity Lower Bounds by Polynomials
The quantum version of communication complexity allows Alice and Bob to communicate qubits and/or to make use of prior entanglement (shared EPR-pairs). Some lower bound techniques are available for qubit communication [17, 11, 2], but except for the inner product function [11], no bounds are known for the model with unlimited prior entanglement. We show that the “log rank” lower bound extends t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2007
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539702405620